Star polygon

Results: 83



#Item
41Martin Held WintersemesterUniversit¨at Salzburg FB Computerwissenschaften

Martin Held WintersemesterUniversit¨at Salzburg FB Computerwissenschaften

Add to Reading List

Source URL: www.cosy.sbg.ac.at

Language: English - Date: 2015-01-12 02:56:56
42Domino Tilings of Orthogonal Polygons Gyorgy Csizmadia{ Jurek Czyzowiczxy Leszek Gasienieck Jorge Urrutiazy

Domino Tilings of Orthogonal Polygons Gyorgy Csizmadia{ Jurek Czyzowiczxy Leszek Gasienieck Jorge Urrutiazy

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:05:33
4316th Canadian Conference on Computational Geometry, 2004  Efficient Polygon Enclosure Algorithms for Device Extraction from VLSI Layouts (Extended Abstract) Vamsi Krishna Kundeti

16th Canadian Conference on Computational Geometry, 2004 Efficient Polygon Enclosure Algorithms for Device Extraction from VLSI Layouts (Extended Abstract) Vamsi Krishna Kundeti

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
44CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Vertex Pops and Popturns Greg Aloupis∗ Martin L. Demaine¶

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Vertex Pops and Popturns Greg Aloupis∗ Martin L. Demaine¶

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:03
45CCCG 2011, Toronto ON, August 10–12, 2011  A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗  Erik D. Demaine†

CCCG 2011, Toronto ON, August 10–12, 2011 A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗ Erik D. Demaine†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
46CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014  Routing in a Polygonal Terrain with the Shortest Beacon Watchtower Bahram Kouhestani  David Rappaport

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Routing in a Polygonal Terrain with the Shortest Beacon Watchtower Bahram Kouhestani David Rappaport

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-07-28 18:39:40
47Counting Problems Counting problems are generally encountered somewhere in any mathematics course. Such problems are usually easy to state and even to get started, but how far they can be taken will vary widely, dependin

Counting Problems Counting problems are generally encountered somewhere in any mathematics course. Such problems are usually easy to state and even to get started, but how far they can be taken will vary widely, dependin

Add to Reading List

Source URL: schools.reap.org.nz

Language: English - Date: 2014-10-23 07:12:59
48Counting Problems Counting problems are generally encountered somewhere in any mathematics course. Such problems are usually easy to state and even to get started, but how far they can be taken will vary widely, dependin

Counting Problems Counting problems are generally encountered somewhere in any mathematics course. Such problems are usually easy to state and even to get started, but how far they can be taken will vary widely, dependin

Add to Reading List

Source URL: www.cleavebooks.co.uk

Language: English - Date: 2007-05-13 18:33:46
49THE ENUMERATION OF PRUDENT POLYGONS BY AREA AND ITS UNUSUAL ASYMPTOTICS NICHOLAS R. BEATON, PHILIPPE FLAJOLET, AND ANTHONY J. GUTTMANN Abstract. Prudent walks are special self-avoiding walks that never take a step toward

THE ENUMERATION OF PRUDENT POLYGONS BY AREA AND ITS UNUSUAL ASYMPTOTICS NICHOLAS R. BEATON, PHILIPPE FLAJOLET, AND ANTHONY J. GUTTMANN Abstract. Prudent walks are special self-avoiding walks that never take a step toward

Add to Reading List

Source URL: algo.inria.fr

Language: English - Date: 2010-11-29 06:38:19
50THE ENUMERATION OF PRUDENT POLYGONS BY AREA AND ITS UNUSUAL ASYMPTOTICS arXiv:1011.6195v1 [math.CO] 29 Nov[removed]NICHOLAS R. BEATON, PHILIPPE FLAJOLET, AND ANTHONY J. GUTTMANN

THE ENUMERATION OF PRUDENT POLYGONS BY AREA AND ITS UNUSUAL ASYMPTOTICS arXiv:1011.6195v1 [math.CO] 29 Nov[removed]NICHOLAS R. BEATON, PHILIPPE FLAJOLET, AND ANTHONY J. GUTTMANN

Add to Reading List

Source URL: algo.inria.fr

Language: English - Date: 2010-12-09 09:10:00